Comparing the Manipulability of Approval Voting and Borda

The Gibbard-Satterthwaite theorem established that no non-trivial voting rule is strategy-proof, but does not mean all rules are equally susceptible to strategic manipulation. Over the past fifty years numerous approaches have been proposed compare manipulability of in terms probability manipulation, domains on which manipulation possible, complexity finding such a and others. In closely related field matching, Pathak Snmez (2013) pioneered notion based case-by-case comparison manipulable profiles. advantage this approach it independent underlying statistical culture or computational power agents, has proven fruitful matching literature. paper, we extend voting, studying families k-approval truncated Borda scoring rules. We find that, with one exception, allow for meaningful ordering these